BHARAT SEVAK SAMAJ
Time: 2 hrs. Max. Marks: 100
I. Fill in the blanks: (10 x 1 = 10)
1. The binary number of 125 is --------------.
2. In Boolean Algebra A + A’ is ------------.
3. Software that converts a high level language program to binary is ----------.
4. --------- is a self complementary code.
5. Carry in a half adder can be obtained using -------------.
6. ----------- is a general purpose processing register.
7. A program execution is usually called ------------.
8. When a file is deleted it is send to the ------------.
9. Restarting a computer is called -----------.
10. The type of PROM that can be erased electrically is called -----------.
II. State whether True or False: (10 x 1 = 10)
1. Stack pointer is not a sequence of memory locations defined by the user.
2. Control bus is a group of lines used for the purpose of data flow.
3. A stack can be placed in a portion of a large memory.
4. LIFO is a stack organization.
5. ROM is a volatile memory.
6. EBCDIC was representing by 256 characters.
7. 9’s complement of 86 is 14.
8. There are only three types of shift registers.
9. CPU stands for Central Processing Unit.
10. 1011-1001-1001 = -0011.
III.Answer any SIX of the following: (6 x 10 = 60)
1. Differentiate Multiplexer and Demulitplexer
2. Explain about Hardware, Software, and Liveware.
3. Explain BCD code with example.
4. Write short notes on programming languages.
5. Write short notes ion ASCII and EBCDIC.
6. Write short notes on different types of memory.
7. Explain the working of a binary counter.
IV. Answer any ONE of the following: (1 x 20 = 20)
1. Explain File organization and access methods.
2. Explain logic gates and their functioning along with the truth tables.